Constellation shaping-related coding selection

ABSTRACT

Aspects of the disclosure relate to wireless communication utilizing a modulation and coding scheme that selectively or dynamically applies probabilistically-shaped coding (PCS) to modulate a transmitted waveform. A communication device may determine whether to apply PCS. If PCS is to be applied, the device can encode the message based on a systematic code; and if PCS is not to be applied, the device can encode the message based on a non-systematic code. Other aspects, embodiments, and features are also claimed and described

TECHNICAL FIELD

The technology discussed below relates generally to wirelesscommunication systems, and more particularly, to generation of awaveform utilizing probabilistic constellation shaping in connectionwith modulation to carry information. Embodiments can provide and enabletechniques for encoding an information sequence when using probabilisticconstellation shaping.

INTRODUCTION

Many modern wireless communication systems employ a form of modulationcommonly known as quadrature amplitude modulation (QAM). QAM is aneffective technique for carrying binary digits (bits) of information,where a symbol of n bits is represented by transmission of two 90°out-of-phase sinusoidal signals (e.g., orthogonal or quadrature signals)at a given carrier frequency (e.g., a subcarrier or tone). However,usage of QAM with a typical grid-like constellation with uniformbit-probability has been empirically demonstrated to be limited to anachievable capacity that fails to meet the Shannon capacity. As thedemand for mobile broadband access continues to increase, research anddevelopment continue to advance wireless communication technologies notonly to meet the growing demand for mobile broadband access, but toadvance and enhance the user experience with mobile communications.

BRIEF SUMMARY OF SOME EXAMPLES

The following presents a simplified summary of one or more aspects ofthe present disclosure, to provide a basic understanding of suchaspects. This summary is not an extensive overview of all contemplatedfeatures of the disclosure, and is intended neither to identify key orcritical elements of all aspects of the disclosure nor to delineate thescope of any or all aspects of the disclosure. Its sole purpose is topresent some concepts of one or more aspects of the disclosure in asimplified form as a prelude to the more detailed description that ispresented later.

In some aspects, this disclosure provides a method, apparatus, andnon-transitory computer-readable medium for wireless communication. Awireless communication device receives a source information sequencerepresenting a message for transmission. If probabilistic constellationshaping is to be applied, the device encodes the source informationsequence based on a systematic-type code; and if probabilisticconstellation shaping is not to be applied, the device encodes thesource information sequence based on a non-systematic-type code. Thedevice generates a sequence of symbols representing the message fortransmission and transmits a waveform based on the generated sequence ofsymbols.

In further aspects, this disclosure provides another method, apparatus,and non-transitory computer-readable medium for wireless communication.A wireless communication device generates a set ofprobabilistically-shaped symbols corresponding to at least a firstportion of a source information sequence. The device further generates apre-encoding sequence corresponding to at least a second portion of thesource information sequence, and applies error correction coding to thepre-encoding sequence to generate an encoded sequence comprising a setof systematic bits and a set of parity bits. Accordingly, the devicegenerates a first set of non-probabilistically-shaped symbolscorresponding to at least a portion of the set of parity bits, replacesa portion of the set of probabilistically-shaped symbols with the set ofnon-probabilistically shaped symbols to generate an output sequence, andmodulates a waveform based on the output sequence.

In still further aspects, this disclosure provides another method,apparatus, and non-transitory computer-readable medium for wirelesscommunication. A wireless communication device receives a waveformcomprising a set of probabilistically-shaped symbols and a set ofnon-probabilistically shaped symbols. The device then demodulates thereceived waveform to generate a sequence of bits and decodes thesequence of bits by omitting a portion of the bits corresponding to aportion of the set of probabilistically-shaped symbols.

And in still further aspects, the present disclosure provides anothermethod, apparatus, and non-transitory computer-readable medium forwireless communication. Based on a source information sequence, awireless communication device generates a sequence of symbolsrepresenting a message for transmission. The device further encodes thesource information sequence based on a systematic-type code if at leasta portion of the generated sequence of symbols has a probabilisticconstellation shaping property, or based on a non-systematic-type codeif the sequence of symbols does not have the probabilistic constellationshaping property. The device then transmits a waveform based on thegenerated sequence of symbols.

These and other aspects of the technology discussed herein will becomemore fully understood upon a review of the detailed description, whichfollows. Other aspects, features, and embodiments will become apparentto those of ordinary skill in the art, upon reviewing the followingdescription of specific, exemplary embodiments in conjunction with theaccompanying figures. While the following description may discussvarious advantages and features relative to certain embodiments andfigures, all embodiments can include one or more of the advantageousfeatures discussed herein. In other words, while this description maydiscuss one or more embodiments as having certain advantageous features,one or more of such features may also be used in accordance with thevarious embodiments discussed herein. In similar fashion, while thisdescription may discuss exemplary embodiments as device, system, ormethod embodiments it should be understood that such exemplaryembodiments can be implemented in various devices, systems, and methods.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic illustration of a wireless communication linkaccording to some aspects of this disclosure.

FIG. 2 is a schematic illustration of an example of a radio interfaceprotocol architecture around a physical layer according to some aspectsof this disclosure.

FIG. 3 is a block diagram illustrating an example of a physical layerentity of a transmitting device according to some aspects of thisdisclosure.

FIG. 4 is a schematic illustration of a low density parity check (LDPC)matrix according to some aspects of this disclosure.

FIG. 5 is a constellation diagram showing examples of aprobabilistically shaped constellation for quadrature amplitudemodulation (QAM) according to some aspects of the disclosure.

FIG. 6 is a schematic diagram illustrating an example implementation ofa physical layer entity of a transmitting device configured forprobabilistic constellation shaping (PCS) according to some aspects ofthe disclosure.

FIG. 7 is a block diagram conceptually illustrating an example of ahardware implementation for a communication device according to someaspects of this disclosure.

FIG. 8 is a flow chart illustrating an exemplary process forconstellation shaping-related coding in accordance with some aspects ofthe disclosure.

FIG. 9 is a flow chart illustrating an exemplary process forconstellation shaping-related coding in accordance with further aspectsof the disclosure.

FIG. 10 is a block diagram illustrating a portion of a communicationdevice configured for replacing information-associated symbols withcorresponding parity-associated symbols according to some aspects of thepresent disclosure.

FIG. 11 is a schematic timing diagram showing various stages of theencoding process corresponding to FIG. 10 .

FIG. 12 is a flow chart illustrating an exemplary process forconstellation shaping-related coding in accordance with further aspectsof the present disclosure.

FIG. 13 is a schematic timing diagram showing various stages of aprobabilistic shaping-related coding process according to a furtheraspect of the present disclosure.

FIG. 14 is a schematic timing diagram showing various stages of aprobabilistic shaping-related coding process according to still furtheraspects of the present disclosure.

FIG. 15 is a flow chart illustrating an exemplary process forconstellation shaping-related coding in accordance with further aspectsof the present disclosure.

DETAILED DESCRIPTION

The detailed description set forth below in connection with the appendeddrawings is intended as a description of various configurations and isnot intended to represent the only configurations in which the conceptsdescribed herein may be practiced. The detailed description includesspecific details for the purpose of providing a thorough understandingof various concepts. However, those skilled in the art will readilyrecognize that these concepts may be practiced without these specificdetails. In some instances, this description provides well knownstructures and components in block diagram form in order to avoidobscuring such concepts.

While this description describes aspects and embodiments by illustrationto some examples, those skilled in the art will understand thatadditional implementations and use cases may come about in manydifferent arrangements and scenarios. Innovations described herein maybe implemented across many differing platform types, devices, systems,shapes, sizes, packaging arrangements. For example, embodiments and/oruses may come about via integrated chip embodiments and othernon-module-component based devices (e.g., end-user devices, vehicles,communication devices, computing devices, industrial equipment,retail/purchasing devices, medical devices, AI-enabled devices, etc.).While some examples may or may not be specifically directed to use casesor applications, a wide assortment of applicability of describedinnovations may occur. Implementations may range a spectrum fromchip-level or modular components to non-modular, non-chip-levelimplementations and further to aggregate, distributed, or OEM devices orsystems incorporating one or more aspects of the described innovations.In some practical settings, devices incorporating described aspects andfeatures may also necessarily include additional components and featuresfor implementation and practice of claimed and described embodiments.For example, transmission and reception of wireless signals necessarilyincludes a number of components for analog and digital purposes (e.g.,hardware components including antenna, RF-chains, power amplifiers,modulators, buffer, processor(s), interleaver, adders/summers, etc.). Itis intended that innovations described herein may be practiced in a widevariety of devices, chip-level components, systems, distributedarrangements, end-user devices, etc. of varying sizes, shapes andconstitution.

The disclosure that follows presents various concepts that may beimplemented across a broad variety of telecommunication systems, networkarchitectures, and communication standards. Referring now to FIG. 1 , asan illustrative example without limitation, this schematic illustrationshows various aspects of the present disclosure with reference to awireless communication link 100 between a transmitter 102 and a receiver106.

The wireless communication link 100 may operate according to anysuitable wireless communication technology or technologies to providecommunication between the transmitter 102 and the receiver 106. As oneexample, the wireless communication link 100 may operate according to3^(rd) Generation Partnership Project (3GPP) New Radio (NR)specifications, often referred to as 5G or 5G NR. As another example,the wireless communication link 100 may operate under a hybrid of 5G NRand Evolved Universal Terrestrial Radio Access Network (eUTRAN)standards, often referred to as Long-Term Evolution (LTE). 3GPP refersto this hybrid RAN as a next-generation RAN, or NG-RAN. Of course, manyother examples may be utilized within the scope of the presentdisclosure.

In the illustrated example, the transmitter 102 is shown as a basestation, and the receiver 106 is shown as a wireless user equipment(UE). However, this configuration is provided only for ease ofdescription, and in various examples, the wireless communication link100 may link any two or more wireless communication nodes of anysuitable kind or category. Broadly, a base station is a network elementin a radio access network responsible for radio transmission andreception in one or more cells to or from a UE. In differenttechnologies, standards, or contexts, a base station may variously bereferred to by those skilled in the art as a base transceiver station(BTS), a radio base station, a radio transceiver, a transceiverfunction, a basic service set (BSS), an extended service set (ESS), anaccess point (AP), a Node B (NB), an eNode B (eNB), a gNode B (gNB), orsome other suitable terminology.

A UE may be referred to by those skilled in the art as a mobile station(MS), a subscriber station, a mobile unit, a subscriber unit, a wirelessunit, a remote unit, a mobile device, a wireless device, a wirelesscommunications device, a remote device, a mobile subscriber station, anaccess terminal (AT), a mobile terminal, a wireless terminal, a remoteterminal, a handset, a terminal, a user agent, a mobile client, aclient, or some other suitable terminology. A UE may be an apparatus(e.g., a mobile apparatus) that provides access to network services.

Within the present document, a “mobile” apparatus need not necessarilyhave a capability to move, and may be stationary. The term mobileapparatus or mobile device broadly refers to a diverse array of devicesand technologies. UEs may include a number of hardware structuralcomponents sized, shaped, and arranged to help in communication. Such UEcomponents can include antennas, antenna arrays, RF chains, amplifiers,one or more processors, etc. electrically coupled to each other. Forexample, some non-limiting examples of a mobile apparatus include amobile, a cellular (cell) phone, a smart phone, a session initiationprotocol (SIP) phone, a laptop, a personal computer (PC), a notebook, anetbook, a smartbook, a tablet, a personal digital assistant (PDA), anda broad array of embedded systems, e.g., corresponding to an “Internetof things” (IoT). A UE may additionally be an automotive or othertransportation vehicle, a remote sensor or actuator, a robot or roboticsdevice, a satellite radio, a global positioning system (GPS) device, anobject tracking device, a drone, a multi-copter, a quadcopter, a remotecontrol device, a consumer and/or wearable device, such as eyewear, awearable camera, a virtual reality device, a smart watch, a health orfitness tracker, a digital audio player (e.g., MP3 player), a camera, agame console, etc. A UE may additionally be a digital home or smart homedevice such as a home audio, video, and/or multimedia device, anappliance, a vending machine, intelligent lighting, a home securitysystem, a smart meter, etc. A UE may additionally be a smart energydevice, a security device, a solar panel or solar array, a municipalinfrastructure device controlling electric power (e.g., a smart grid),lighting, water, etc.; an industrial automation and enterprise device; alogistics controller; agricultural equipment; military defenseequipment, vehicles, aircraft, ships, and weaponry, etc. Still further,a mobile apparatus may provide for connected medicine or telemedicinesupport, e.g., health care at a distance. Telehealth devices may includetelehealth monitoring devices and telehealth administration devices,whose communication may be given preferential treatment or prioritizedaccess over other types of information, e.g., in terms of prioritizedaccess for transport of critical service data and/or for relevantquality of service (QoS) for transport of critical service data.

Wireless communication between a transmitter 102 (e.g., a base station)and a receiver 106 (e.g., a UE) may be described as utilizing an airinterface. Transmissions over the air interface from a base station toone or more UEs may be referred to as downlink (DL) transmission. Inaccordance with certain aspects of the present disclosure, the term“downlink” may refer to a point-to-multipoint transmission originatingat a scheduling entity (described further below; e.g., a base station).Another way to describe this scheme may be to use the term broadcastchannel multiplexing. Transmissions from a UE to a base station may bereferred to as uplink (UL) transmissions. In accordance with furtheraspects of the present disclosure, the term “uplink” may refer to apoint-to-point transmission originating at a scheduled entity (describedfurther below; e.g., a UE).

In some examples, access to the air interface may be scheduled, whereina scheduling entity (e.g., a base station) allocates resources forcommunication among some or all devices and equipment within its servicearea or cell. Within the present disclosure, as discussed further below,a scheduling entity may be responsible for scheduling, assigning,reconfiguring, and releasing resources for one or more scheduledentities (e.g., UEs). That is, for scheduled communication, a UE, whichmay be a scheduled entity, may utilize resources allocated by ascheduling entity (e.g., a base station or another UE).

Base stations are not the only entities that may function as schedulingentities. That is, in some examples, a UE may function as a schedulingentity, where the UE is configured for scheduling resources for one ormore scheduled entities (e.g., one or more other UEs) in a wirelesscommunication system.

In some aspects of the disclosure, the scheduling entity and/orscheduled entity may be configured for beamforming and/or multiple-inputmultiple-output (MIMO) technology. In a MIMO system, a transmitter 102includes multiple transmit antennas 104 and a receiver 106 includesmultiple receive antennas 108. The use of such multiple antennatechnology enables the wireless communication system to exploit thespatial domain to support spatial multiplexing, beamforming, andtransmit diversity. Spatial multiplexing may be used to transmitdifferent streams of data, also referred to as layers, simultaneously onthe same time-frequency resource. The data streams may be transmitted toa single UE to increase the data rate or to multiple UEs to increase theoverall system capacity, the latter being referred to as multi-user MIMO(MU-MIMO). This is achieved by spatially precoding each data stream(i.e., multiplying the data streams with different weighting and phaseshifting) and then transmitting each spatially precoded stream throughmultiple transmit antennas on the downlink. The spatially precoded datastreams arrive at the UE(s) with different spatial signatures, whichenables each of the UE(s) to recover the one or more data streamsdestined for that UE. On the uplink, each UE transmits a spatiallyprecoded data stream, which enables the base station to identify thesource of each spatially precoded data stream.

A radio protocol architecture may take on various forms depending on theparticular application. An example for a NR system will now be presentedwith reference to FIG. 2 , which schematically illustrates a radiointerface protocol architecture around the physical layer (Layer 1). Thephysical layer interfaces the Medium Access Control (MAC) sub-layer ofLayer 2 and the Radio Resource Control (RRC) Layer of Layer 3. Thecircles between different layer/sub-layers indicate Service AccessPoints (SAPs). The physical layer offers a transport channel to MAC. Thetransport channel is characterized by how the information is transferredover the radio interface. MAC offers different logical channels to theRadio Link Control (RLC) sub-layer of Layer 2. A logical channel ischaracterized by the type of information transferred.

The RRC sublayer is responsible for obtaining radio resources (e.g.,radio bearers) and for configuring the lower layers using RRC signalingbetween a base station and UE. The MAC sublayer has various functions,such as allocating the various radio resources (e.g., resource blocks)in one cell among the UEs HARQ operations, etc. The physical layer alsohas various functions, such as channel coding, scrambling, modulation,transform precoding, mapping, etc.

In some examples, a MAC entity of a UE is configured to handle one ormore transport channels. Example transport channels that the MAC entitymay handle include: Broadcast Channels (BCHs); Downlink Shared Channels(DL-SCHs); Paging Channels (PCHs); Uplink Shared Channels (UL-SCHs); andRandom Access Channels (RACHs), among others. In some examples, a UE mayuse a single MAC entity; and in some examples, a UE may use a pluralityof MAC entities (e.g., one for a Master Cell Group (MCG) and one for aSecondary Cell Group (SCG) in a network configured for DualConnectivity). Example MAC entities used by a UE may include source MACentities and target MAC entities.

FIG. 3 is a schematic illustration providing additional information withrespect to some components of a physical layer 302. The block diagramprovided in FIG. 3 is not intended to show all components of a givenphysical layer, but is rather to be understood as providing somefunctional detail of a portion of an exemplary physical layer for thepurpose of explanation of certain aspects of this disclosure. As shownin FIG. 3 , a physical layer may receive a message or a set ofinformation for communication from any suitable information source 304.For example, the MAC layer may provide a source information sequence tothe physical layer entity 302 for transmission.

An error correction coder 306, or channel coder, employs forward errorcorrection to map sequences of message bits (e.g., information blocks,code blocks, code block groups, etc.) to longer, redundant sequences(e.g., codewords). A bit-level processing block 308 can perform variousfunctions such as scrambling, interleaving, etc., at a bit level. Amodulation mapper 310 maps sequences of bits to corresponding symbols(e.g., complex numbers) according to a selected modulation scheme.Modulation refers to the way a carrier signal is modulated, or variedover time, to represent information to be transmitted. A symbol-levelprocessing and mapping block 312 performs various functions, such aslayer mapping, resource mapping, symbol-level interleaving, antennamapping, etc. An OFDM signal generator 314 generates signals fortransmission over a set of one or more antennas. OFDM refers toorthogonal frequency division multiplexing. That is, an air interfacemay be defined according to a two-dimensional grid of resource elements,defined by separation of resources in frequency by defining a set ofclosely spaced frequency tones or sub-carriers, and separation in timeby defining a sequence of symbols having a given duration. By settingthe spacing between the tones based on the symbol rate, inter-symbolinterference can be essentially eliminated. OFDM channels provide forhigh data rates by allocating a data stream in a parallel manner acrossmultiple subcarriers. In any case, OFDM signal generator 314 maytransmit, via transceiver 104 or transceiver 108, a waveform modulatedaccording to a sequence of symbols generated by symbol-level processingand mapping block 312.

When an apparatus transmits such a signal, the signal propagates over anoisy channel 316. As used throughout this disclosure, a “channel”generally refers to a medium through which a signal passes. Oncetransmitted, noise in the channel (e.g., random disturbances) can affectthe signal before the signal arrives at a receiver/decoder device 318(e.g., UE 106 or base station 102). The receiver/decoder device 318,then, attempts to process the received signal and reproduce the originalinformation message.

Channel Coding

In order for transmissions over a noisy channel 316 to obtain a lowblock error rate (BLER) while still achieving very high data rates, anerror correction coder 306 may implement channel coding. Wirelesscommunication according to various aspects of this disclosure maygenerally utilize any suitable error correcting block code. In a typicalblock code, an information message or sequence is split up into codeblocks (CBs), and an encoder (e.g., a CODEC) at the transmitting devicethen mathematically adds redundancy to the information message.Exploitation of this redundancy in the encoded information message canimprove the reliability of the message, enabling correction for biterrors that may occur due to the noise.

In some examples, a channel coder may employ parity-check codes, wherethe encoder generates code words by combining blocks of message bitswith blocks of check bits, where each check bit is a modulo-2 sum of agiven set of the message bits. Such a parity-check code can berepresented by a parity-check matrix. Among this group, low-densityparity check codes generally refer to codes that are represented by amatrix with a low density of 1's, and mostly filled with 0's.

FIG. 4 provides an example of a base graph that may be employed by achannel coder configured for LDPC coding. In 5G NR specifications, userdata may be coded using quasi-cyclic low-density parity check (LDPC)codes with two different base graphs: one base graph for large codeblocks and/or high code rates, while the other base graph is usedotherwise. Control information and a physical broadcast channel (PBCH)may be coded using Polar coding, based on nested sequences. For thesechannels, puncturing, shortening, and/or repetition may be used for ratematching.

Those skilled in the art will understand that aspects of the presentdisclosure may be implemented utilizing any suitable channel code.Various implementations of scheduling entities (e.g., base station 102,or a UE 106) and scheduled entities 106 (e.g., UE 106) may includesuitable hardware and capabilities (e.g., an encoder, a decoder, and/ora CODEC) to utilize one or more of these channel codes for wirelesscommunication.

QAM

Many modern wireless communication systems employ a form of modulationcommonly known as quadrature amplitude modulation (QAM). QAM is aneffective technique for carrying binary digits (bits) of information,where a symbol of n bits is represented by transmission of two 90°out-of-phase sinusoidal signals (e.g., orthogonal or quadrature signals)at a given carrier frequency (e.g., a subcarrier or tone). QAM isreadily understood with reference to a constellation diagram. Referringnow to FIG. 5 , in a typical constellation diagram for QAM, a set ofconstellation points is arranged in a grid, and is mapped to the complexplane. In a constellation diagram with 2^(n) constellation points, eachconstellation point can represent a predefined n-bit sequence or symbol.For example, in the illustration, 16-QAM is shown, with 2⁴=16constellation points each representing a respective 4-bit sequence orsymbol. By treating the amplitudes of the respective quadrature signalsas representative of a real part and an imaginary part of a complexnumber, in theory a transmission can represent any suitable complexnumber. With QAM, a modulation mapper maps an n-bit sequence to theappropriate complex number in the corresponding constellation diagram,and the amplitudes of the quadrature signals are scaled to represent thecorresponding complex number.

Probabilistic Constellation Shaping

According to Shannon's Coding Theorem, introduced by Claude Shannon in1948 and well-known to those skilled in the art, there exist theoreticalbounds for a channel capacity in a given channel. A channel capacitygenerally represents a maximum transmission rate for a given channelbased on the signal-to-noise ratio (SNR). This channel capacity may begenerally referred to as the “Shannon capacity.”

QAM typically employs a uniform constellation map having a uniform(e.g., grid-like) distribution of symbols in the complex plane, and auniform (e.g., constant magnitude) probability of use of constellationsymbols. QAM employing uniform constellation mapping has beenempirically demonstrated to be limited to an achievable capacity thatfalls below the channel capacity. However, a non-uniform distribution ofconstellation symbols can improve channel performance with QAM, with anachievable capacity that better approximates, or in some cases, can evenessentially meet the channel capacity of the channel used to transmit aninformation message.

In some examples, techniques for non-uniform distribution utilizing QAMinclude geometric constellation shaping and/or probabilisticconstellation shaping. With geometric constellation shaping, eachconstellation point in the complex plane is generally utilized with anequal probability, but the location of the constellation points in thecomplex plane is altered from the uniform grid to exhibit a generallyGaussian amplitude distribution. With probabilistic constellationshaping (PCS), also referred to in the field as probabilistic amplitudeshaping (PAS), a more conventional (e.g., grid-like) uniformdistribution of symbols is used in the complex plane, but with anon-equal probability of use of the respective constellation symbols.Referring again to FIG. 5 , one example of such a PAS constellation isshown, where the shading at each constellation point schematicallyrepresents the probability of the corresponding constellation symbolbeing employed for a transmission. It should be noted that, although aparticular grid arrangement is shown in FIG. 4 , the techniques of thisdisclosure are not so limited, and any number of different distributiongrids may be used in various examples.

FIG. 6 includes a schematic block diagram illustrating one example of aphysical layer entity implementing probabilistic constellation shaping(PCS). In the illustrated example, the functions or operations shown areperformed from the point of view of a physical layer entity in atransmitting device. As shown, an information source 601 (e.g., a MAClayer or any other suitable source of information for transmission)provides a source information sequence B of k bits of binary data {B₀, .. . , B_(k−1)}, where k is an integer. In the discussion that follows,the notation S(n)˜S(p) is equivalent to, and interchangeable with, thenotation {S_(n), . . . , S_(p)} representing a sequence of (p−n+1)elements. Thus, the sequence B may be denoted B(0)˜B(k−1).

A split block or function 602 splits, segments, or separates this sourcesequence into two parts, where a first part B(i)˜B(k−1) includes asequence of (k−i) bits, and a second part B(0)˜B(i−1) includes asequence of i bits, where i≤k is an integer.

The first part B(i)˜B(k−1) of the data is provided to a distributionmatcher (DM) 604 (e.g., a modulation mapper), which maps an input of(k−i) bits to an ordered sequence of (m) amplitudes A(0)˜A(m−1) (where mis an integer), having the desired, nonuniform probabilities. This way,a transmitting device utilizing PAS can obtain a nonuniform (e.g.,shaped) probability of symbols for the constellation. That is, a DM 604takes as an input a sequence of (k−i) independent bits or symbols, andprovides as an output a sequence of (m) amplitude symbols (e.g., complexnumbers) having a nonuniform distribution of amplitudes that representsthe message according to the PAS technique.

In various examples, a DM may utilize any of a number of suitablealgorithms and have any of a number of suitable configurations. Someexamples of DMs known in the art include a constant-composition DM(CCDM), a prefix-free distribution matching DM (PCDM), amultiset-partition DM (MPDM), a product bit-level DM, aparallel-amplitude DM with subset ranking, a streaming DM, shellmapping, enumerative sphere shaping, framing of variable-length DMoutputs into fixed-length blocks, a DM with mark ratio control, etc.Although the aforementioned DM techniques differ from one another, ingeneral, a DM system generates a probabilistically determined sequenceof symbols configured with an aim to employ a probabilistically shapedwaveform (e.g., a QAM waveform).

The second part B(0)˜B(i−1) of the data is provided to a channel coder608 (e.g., unchanged by the DM 604). In addition, the amplitude symbolsequence A(0)˜A(m−1) from the DM 604 (configured according to the PAStechnique) is converted to an ordered sequence of binary bitsb[A(0)]˜b[A(m−1)] by a suitably configured amplitude-to-binary (A→B)mapping block 606. That is, b[S(n)] represents the result of theapplication of a function or map b that maps an input sequence {S(n)},consisting of amplitude symbols (e.g., S(n)∈

), to an output sequence {B(q)}, consisting of binary symbols (i.e.,B(q)∈(0, 1)). This sequence {B} of binary bits is also provided to thechannel coder 608. In a particular example, any suitable function b forthe generation of binary bit sequences based on an amplitude symbolsequence may be employed. For example, the A→B mapping block 606 mayemploy an M-ary amplitude to binary mapping technique, which generates asequence of log₂(M)·m binary bits.

Referring now to schematic timing diagram 650, the data from theinformation source 601 is shown in the first row, represented by thebinary sequence B(0)˜B(k−1). As shown in the second row, the splitter602 splits, separates, or segments the data into two parts: one ofwhich, as shown in the third row, is converted to a sequence ofamplitude symbols based on PAS. As shown in the fourth row, part of thesplit data sequence is combined with a sequence of binary bits based onthe amplitude symbol sequence, providing a pre-encoding input to thechannel coder 608. As discussed above, the channel coder 608 takes as aninput the second part B(0)˜B(i−1) of the data, and a binary sequenceb[A(0)]˜b[A(m−1)] corresponding to a PAS-mapped portion of the data,i.e., the first part B(i)˜B(k−1) of the data. The channel coder 608encodes this input to generate an encoded output sequence, which in someexamples, may be represented by a length-n sequence of parity bitsC(0)˜C(n−1), where n is an integer.

A sign bits extraction block 618 extracts a sequence of m sign bitsS(0)˜S(m−1) from the parity bits C(0)˜C(n−1), which are provided to asign multiply block 616, which combines the sign bits S(0)˜S(m−1) withthe sequence of amplitude symbols A(0)˜A(m−1) from the DM 604 describedabove, to generate a sequence of output symbols X(0)˜X(m−1). The outputsymbols are then modulated (e.g., according to QAM) for transmission viaone or more antennas.

Channel Coding with Constellation Shaping

In order to provide for constellation shaping with channel coding, asystematic-type coding may be used. As is well known in the art, asystematic-type code generates a code word that includes the originalinput sequence, without change (e.g., unaltered). For example, the firstR symbols of the code word may include the unaltered, original inputsequence; and remaining symbols of the code word may be parity bits orcheck bits. In contrast, a nonsystematic-type code generates a code wordwhere the input sequence is altered or changed during the encodingprocess. By utilizing a systematic-type code, for constellation shapingwith coding assistance, only the parity of the coded information ischanged, and all systematic bits are used to generate the sameconstellation.

However, concurrent channel coding (e.g., LDPC) may not provide asystematic output. For example, according to presently existingspecifications for 3GPP 5G NR, an LDPC encoder may puncture the firsttwo columns of its base graph or parity check matrix. For example, whenemploying a multi-edge type (MET) code with a lift size of Z_(c), thefirst 2Z_(c) information bits are punctured. Thus, the first 2Z_(c)information bits are not transmitted. Therefore, the code is no longer asystematic code.

After puncturing these systematic bits, an encoder may replace them withparity bits or check bits. However, as discussed above, withprobabilistic constellation shaping, the encoder 608 applies shapedsymbols b[A(0)]˜b[A(m−1)] to the check bits, while it applies auniformly distributed constellation to the systematic bits. Thus,replacement of the punctured systematic bits with check bits compromisesthe probabilistic constellation shaping.

That is, if an encoder uses conventional, non-systematic coding withPCS, there is a potential loss of PCS-related shaping gain, and reducedthroughput. And on the other hand, if the encoder uses a different(e.g., systematic) coding algorithm with PCS, while the PCS-relatedshaping gain can be preserved, there is a potential loss of coding gain.

In various aspects, the present disclosure provides a modulation andcoding technique for probabilistic constellation shaping that can enabledynamic modulation and/or coding to avoid the issues caused bypuncturing systematic bits represented by symbols with aprobabilistically shaped constellation. That is, some aspects of thisdisclosure provide for a technique for probabilistic signal shaping andchannel coding that outputs systematic bits and non-systematic bits, tosupport signals with and without probabilistic constellation shaping,respectively. In this way, a communication device can be enabled toachieve increased throughput based on the shaping gain provided by PCS.

Furthermore, if an encoder utilizes a conventional, non-systematic LDPCcoding algorithm, the encoder is capable of adapting or controlling thetransmission rate by changing characteristics of the encoder (e.g., thecoding rate). However, if the encoder employs aspects of the presentlydisclosed PCS-based coding design, the encoder can adapt or control thetransmission rate using the PCS mechanism without necessarily changingthe characteristics of the encoder. Thus, employing PCS as describedherein can provide an additional degree of freedom for an encoder toconfigure or optimize its transmission rate.

Example Block Diagram

FIG. 7 is a block diagram illustrating an example of a hardwareimplementation for a communication device 700 employing a processingsystem 714 for channel coding with constellation shaping. For example,the communication device 700 may be a user equipment (UE) or basestation, as illustrated in FIG. 1 . In another example, thecommunication device 700 may be, or may include, a physical layer entityas illustrated in any one or more of FIGS. 3, 6 , and/or 10.

The communication device 700 may include a processing system 714 havingone or more processors 704. Examples of processors 704 includemicroprocessors, microcontrollers, digital signal processors (DSPs),field programmable gate arrays (FPGAs), programmable logic devices(PLDs), state machines, gated logic, discrete hardware circuits, andother suitable hardware configured to perform the various functionalitydescribed throughout this disclosure. In some examples, the processor704 may include, and/or may be coupled to an encoder as illustrated inFIG. 3 , and/or a portion of an encoder as illustrated in FIGS. 6 and/or10 . In various examples, the communication device 700 may be configuredto perform any one or more of the functions described herein. That is,the processor 704, as utilized in a communication device 700, may beconfigured (e.g., in coordination with the memory 705) to implement anyone or more of the processes and procedures described below andillustrated in FIGS. 8, 9, 11, 12, 13 , and/or 14.

The processing system 714 may be implemented with a bus architecture,represented generally by the bus 702. The bus 702 may include any numberof interconnecting buses and bridges depending on the specificapplication of the processing system 714 and the overall designconstraints. The bus 702 communicatively couples together variouscircuits including one or more processors (represented generally by theprocessor 704), a memory 705, and computer-readable media (representedgenerally by the computer-readable medium 706). The bus 702 may alsolink various other circuits such as timing sources, peripherals, voltageregulators, and power management circuits, which are well known in theart, and therefore, will not be described any further. A bus interface708 provides an interface between the bus 702 and a transceiver 710. Thetransceiver 710 provides a communication interface or means forcommunicating with various other apparatus over a transmission medium.For example, the transceiver 710 may apply a suitable modulation (e.g.,probabilistically constellation shaped) and transmitting a modulatedwaveform. The transceiver 710 may further receive a waveformtransmission, e.g., including any suitable (e.g., PCS) modulation anddemodulating the received transmission. Depending upon the nature of thecommunication device, a user interface 712 (e.g., keypad, display,speaker, microphone, joystick) may also be provided. Of course, such auser interface 712 is optional, and some examples, such as a basestation, may omit it.

In some aspects of the disclosure, the processor 704 may includecommunication control circuitry 740 configured (e.g., in coordinationwith the memory 705) for various functions, including, e.g., receivingand applying configuration information for, e.g., configuring amodulation and coding scheme (MCS) for a message transmission, fordetermining whether to apply probabilistic constellation shaping (PCS)for a message transmission, for generating non-probabilistically shapedsymbols, and for puncturing and replacing bits and/or symbols in theirrespective sequences. For example, the communication control circuitry740 may be configured to implement one or more of the functionsdescribed below in relation to FIG. 8 , including, e.g., blocks 802,804, 806, 812, and/or 814; FIG. 9 , including, e.g., blocks 902, 904,906, 912, and/or 914; FIG. 10 , including, e.g., blocks 1002, 1006,1010, 1012, 1014, 1016, 1018, and/or 1020; and/or FIG. 12 , including,e.g., blocks 1206, 1208, 1210, and/or 1212.

In further aspects of the disclosure, the processor 704 may includedistribution matching (DM) circuitry 742 configured (e.g., incoordination with the memory 705) for various functions, including,e.g., generating probabilistically-shaped symbols. In some examples, theDM circuitry 742 may correspond to a modulation mapper, as describedabove; and in some examples, such a modulation mapper may beconfigurable to select probabilistic or non-probabilistic constellationmapping. For example, the DM circuitry 742 may be configured toimplement one or more of the functions described below in relation toFIG. 8 , including, e.g., block 812; FIG. 9 , including, e.g., block912; FIG. 10 , including, e.g., block 1004; FIG. 12 , including, e.g.,block 1204; and/or FIG. 15 , including, e.g., block 1502.

In further aspects of the disclosure, the processor 704 may include anerror correction coder or CODEC circuitry 744 configured (e.g., incoordination with the memory 705) for various functions, including,e.g., applying forward error correction or channel coding to generate anencoded sequence utilizing any suitable systematic or non-systematiccode, and/or decoding an encoded sequence. Here, the CODEC circuitry 744may be dynamically controlled or configured to apply any suitable basegraph or coding type. For example, the CODEC circuitry 744 may beconfigured to implement one or more of the functions described below inrelation to FIG. 8 , including, e.g., blocks 808 and/or 810; FIG. 9 ,including, e.g., blocks 908 and/or 910; FIG. 10 , including, e.g., block1008; FIG. 12 , including, e.g., block 1202; FIG. 14 , including, e.g.,block 1404; and/or FIG. 15 , including, e.g., blocks 1506 and/or 1508.

The processor 704 is responsible for managing the bus 702 and generalprocessing, including the execution of software stored on thecomputer-readable medium 706. The software, when executed by theprocessor 704, causes the processing system 714 to perform the variousfunctions described below for any particular apparatus. The processor704 may also use the computer-readable medium 706 and the memory 705 forstoring data that the processor 704 manipulates when executing software.

One or more processors 704 in the processing system may executesoftware. Software shall be construed broadly to mean instructions,instruction sets, code, code segments, program code, programs,subprograms, software modules, applications, software applications,software packages, routines, subroutines, objects, executables, threadsof execution, procedures, functions, etc., whether referred to assoftware, firmware, middleware, microcode, hardware descriptionlanguage, or otherwise. The software may reside on a computer-readablemedium 706. The computer-readable medium 706 may be a non-transitorycomputer-readable medium. A non-transitory computer-readable mediumincludes, by way of example, a magnetic storage device (e.g., hard disk,floppy disk, magnetic strip), an optical disk (e.g., a compact disc (CD)or a digital versatile disc (DVD)), a smart card, a flash memory device(e.g., a card, a stick, or a key drive), a random access memory (RAM), aread only memory (ROM), a programmable ROM (PROM), an erasable PROM(EPROM), an electrically erasable PROM (EEPROM), a register, a removabledisk, and any other suitable medium for storing software and/orinstructions that may be accessed and read by a computer. Thecomputer-readable medium 706 may reside in the processing system 714,external to the processing system 714, or distributed across multipleentities including the processing system 714. The computer-readablemedium 706 may be embodied in a computer program product. By way ofexample, a computer program product may include a computer-readablemedium in packaging materials. Those skilled in the art will recognizehow best to implement the described functionality presented throughoutthis disclosure depending on the particular application and the overalldesign constraints imposed on the overall system.

In one or more examples, the computer-readable storage medium 706 maystore computer-executable code that includes communication controlinstructions 760 that configure a communication device 700 for variousfunctions, including, e.g., receiving and applying configurationinformation for, e.g., configuring a modulation and coding scheme (MCS)for a message transmission, for determining whether to applyprobabilistic constellation shaping (PCS) for a message transmission,for generating non-probabilistically shaped symbols, and for puncturingand replacing bits and/or symbols in their respective sequences. Forexample, the communication control instructions 760 may be configured toimplement one or more of the functions described below in relation toFIG. 8 , including, e.g., blocks 802, 804, 806, 812, and/or 814; FIG. 9, including, e.g., blocks 902, 904, 906, 912, and/or; FIG. 10 ,including, e.g., blocks 1002, 1006, 1010, 1012, 1014, 1016, 1018, and/or1020; and/or FIG. 12 , including, e.g., blocks 1206, 1208, 1210, and/or1212.

In further examples, the computer-readable storage medium 706 may storecomputer-executable code that includes distribution matching (DM) (e.g.,modulation mapping) instructions 762 that configure a communicationdevice 700 for various functions, including, e.g., generatingprobabilistically-shaped symbols. For example, the DM instructions 762may be configured to implement one or more of the functions describedbelow in relation to FIG. 8 , including, e.g., block 812; FIG. 9 ,including, e.g., block 912; FIG. 10 , including, e.g., block 1004; FIG.12 , including, e.g., block 1204; and/or FIG. 15 , including, e.g.,block 1502.

In further examples, the computer-readable storage medium 706 may storecomputer-executable code that includes error correction coding/decoding(CODEC) instructions 764 that configure a communication device 700 forvarious functions, including, e.g., applying channel coding to generatean encoded sequence utilizing any suitable systematic or non-systematiccode, and/or decoding an encoded sequence. Here, the CODEC circuitry 744may be dynamically controlled or configured to apply any suitable basegraph or coding type. For example, the CODEC instructions 764 may beconfigured to implement one or more of the functions described below inrelation to FIG. 8 , including, e.g., blocks 808 and/or 810; FIG. 9 ,including, e.g., blocks 908 and/or 910; FIG. 10 , including, e.g., block1008; FIG. 12 , including, e.g., block 1202; FIG. 14 , including, e.g.,block 1404; and/or FIG. 15 , including, e.g., blocks 1506 and/or 1508.

In one configuration, the communication device 700 includes means forreceiving a source information sequence, means for determining an MCSconfiguration, means for determining whether to apply PCS for a messagetransmission, means for encoding and/or decoding a message (e.g., byapplying error correction coding) based on any suitable codingalgorithm, means for generating probabilistically-shaped symbols, meansfor generating non-probabilistically shaped symbols, and means forbit-level and/or symbol-level processing and mapping. In one aspect, theaforementioned means may be the processor(s) 704 shown in FIG. 7configured to perform the functions recited by the aforementioned means.In another aspect, the aforementioned means may be a circuit or anyapparatus configured to perform the functions recited by theaforementioned means.

Of course, in the above examples, the circuitry included in theprocessor 704 is merely provided as an example, and other means forcarrying out the described functions may be included within variousaspects of the present disclosure, including but not limited to theinstructions stored in the computer-readable storage medium 706, or anyother suitable apparatus or means described in any one of the FIGS. 1,2, 3, 6, 7 , and/or 10, and utilizing, for example, the processes and/oralgorithms described herein in relation to FIGS. 8, 9, 11, 12, 13, 14 ,and/or 15.

Selection Between Systematic Coding and Non-Systematic Coding withPuncturing of Systematic Bits Based on Whether PCS is Applied

FIG. 8 is a flow chart illustrating an exemplary process 800 forconstellation shaping-related coding in accordance with some aspects ofthe present disclosure. In this example, a communication device decidesto utilize systematic-type coding if probabilistic constellation shapingis to be applied, and to utilize a non-systematic-type coding (e.g.,NR-LDPC including puncturing of a portion of the systematic bits) ifprobabilistic constellation shaping is not to be applied.

As described below, a particular implementation may omit some or allillustrated features, and may not require some illustrated features toimplement all embodiments. In some examples, the communication device700 illustrated in FIG. 7 may be configured to carry out the process800. In some examples, any suitable apparatus or means for carrying outthe functions or algorithm described below may carry out the process800. In the illustrated example, the functions or operations shown areperformed from the point of view of a physical layer entity in acommunication device. For example, an encoder, which may includeprobabilistic signal shaping and channel coding features, may beconfigured to implement the process illustrated in FIG. 8 .

As illustrated, at block 802, a communication device may receive asource information sequence representing a message for transmission. Forexample, a physical layer entity may receive information from anysuitable source, such as a MAC layer entity as described above.

At block 804, the communication device may determine a configuration fora modulation and coding scheme (MCS) to apply to a given block ofinformation (e.g., a transport block, a source information sequence, acode block, a code block group, or any other suitable set ofinformation). For example, a modem or other physical layer entity mayreceive (e.g., from a higher layer entity such as a MAC entity) asuitable set of configuration parameters, such as MCS parameters orother configuration parameters, indicating configuration informationsuch as how many bits are to be encoded, a code rate, what the outputbit length will be, etc.

At block 806, the communication device may determine whether theconfiguration indicates that probabilistic constellation shaping is tobe applied. For example, the modem may determine whether a received setof configuration parameters includes one or more constellation shapingparameters. That is, according to an aspect of the present disclosure,if the configuration indicates that probabilistic constellation shapingis to be applied, the configuration received at block 804 may includeone or more suitable constellation shaping parameters. Some examples ofconstellation shaping parameters can include abinary-bits-to-amplitude-symbols mapping parameter, a distributionparameter for configuring a DM for shaping a constellation for a targetprobability distribution, and an explicit (e.g., direct) instructionwhether to apply probabilistic constellation shaping. In general, themodem may identify any suitable parameter that enables or configures PCSas a parameter sufficient to apply probabilistic constellation shaping.

If the communication device determines that probabilistic constellationshaping is to be applied, then at block 810 an encoder may utilize asystematic coding output for encoding the source information sequence.On the other hand, if the device determines that probabilisticconstellation shaping is not to be applied, then at block 808 theencoder may utilize a non-systematic coding output (e.g., legacy codingaccording to 5G NR specifications for LDPC coding) for encoding thesource information sequence.

In various examples, the encoder may employ any suitable systematiccoding algorithm in the case that PCS is to be applied, such that thecoding algorithm is compatible with PCS. In some examples, thesystematic coding corresponding to block 806 may utilize the same basegraph as the non-systematic LDPC coding corresponding to block 808. In afurther example, an encoder may employ the following puncturingparameter for LDPC encoding, such that all components related topuncturing that currently indicate a value of 2Z_(c) are changed to Z′:

$Z^{\prime} = \left\{ \begin{matrix}0 & {{if}{}{PCS}{is}{applied}} \\{2Z_{c}} & {{if}{}{PCS}{is}{not}{applied}}\end{matrix} \right.$

For example, the modem may set a value of a puncturing parameter (e.g.,Z′) to zero (0) when a systematic-type coding is applied (e.g., when PCSis applied); and the modem may set a value of the puncturing parameterto a nonzero value (e.g., 2Z_(c)) when a non-systematic-type coding isapplied (e.g., when PCS is not applied).

At block 812, the wireless communication device may generate a sequenceof symbols representing the message for transmission. For example, adistribution matcher (if probabilistic constellation shaping is applied)or a binary-to-amplitude converter (if probabilistic constellationshaping is not applied) may convert at least a portion of the sourceinformation sequence into a sequence of amplitude symbols.

At block 814, the wireless communication device may transmit a waveformbased on the sequence of symbols. For example, a transceiver 710 maygenerate a waveform based on the generated sequence of symbols andtransmit the waveform over a wireless transmission, as described above.

Example 2—Selection Between Different Base Graphs

FIG. 9 is a flow chart illustrating an exemplary process 900 forconstellation shaping-related coding in accordance with some aspects ofthe present disclosure. In this example, a communication device decidesto utilize a first base graph for channel coding if probabilisticconstellation shaping is to be applied, and to utilize a second basegraph for channel coding if probabilistic constellation shaping is notto be applied.

As described below, a particular implementation may omit some or allillustrated features, and may not require some illustrated features toimplement all embodiments. In some examples, the communication device700 illustrated in FIG. 7 may be configured to carry out the process900. In some examples, any suitable apparatus or means for carrying outthe functions or algorithm described below may carry out the process900. In the illustrated example, the functions or operations shown areperformed from the point of view of a physical layer entity in atransmitting device. For example, an encoder, which may includeprobabilistic signal shaping and channel coding features, may beconfigured to implement the process illustrated in FIG. 9 .

As illustrated, at block 902, a communication device may receive asource information sequence representing a message for transmission. Forexample, a physical layer entity may receive information from anysuitable source, such as a MAC layer entity as described above.

At block 904, the communication device may determine an MCSconfiguration, for example as described above in connection with block804. And also similar to the procedure of FIG. 8 , at block 906, thedevice may determine whether a set of received configuration parametersindicates that the device is to apply probabilistic constellationshaping, e.g., by including one or more suitable constellation shapingparameters.

If the device determines that probabilistic constellation shaping is tobe applied, then at block 908 it may encode the source informationsequence utilizing a first base graph. On the other hand, if the encoderdetermines that probabilistic constellation shaping is not to beapplied, then at block 910 the device may encode the source informationsequence utilizing a second base graph, different from the first basegraph. In various examples, any suitable base graphs may be employed forselection between different base graphs based on whether PCS is to beapplied. For example, selection of a base graph may be made based on oneor more performance characteristics (e.g., throughput, coding gain,etc.) for each respective configuration. In some examples, a first basegraph may correspond to a systematic code, while a second base graph maycorrespond to a non-systematic code. Accordingly, the wirelesscommunication device may select between a first base graph forsystematic coding if PCS is to be applied, and a second base graph fornon-systematic coding if PCS is not to be applied.

At block 912, the wireless communication device may generate a sequenceof symbols representing the message for transmission. For example, adistribution matcher (if probabilistic constellation shaping is applied)or a binary-to-amplitude converter (if probabilistic constellationshaping is not applied) may convert at least a portion of the sourceinformation sequence into a sequence of amplitude symbols.

At block 914, the wireless communication device may transmit a waveformbased on the sequence of symbols. For example, a transceiver 710 maygenerate a waveform based on the generated sequence of symbols andtransmit the waveform over a wireless transmission, as described above.

Example 3—Replace Punctured Symbols with Parity Bits

FIG. 10 provides a functional illustration of a portion of acommunication device configured for constellation shaping-related codingaccording to a further aspect of this disclosure. In this example, asfurther described below, the communication device may replace certaininformation-associated symbols being punctured with parity-associatedsymbols. Some of the functional blocks illustrated in FIG. 10 may be thesame or similar to blocks having the same name, described above andillustrated in FIG. 6 . The description that follows is simplified forclarity in relation to those blocks that are the same or similar, withreference to FIG. 6 as needed.

FIG. 11 provides a schematic timing diagram showing various stages ofthe process corresponding to FIG. 10 . In this illustration, timegenerally moves forward in the downward direction from row to row. Inthe following discussion, reference is made to elements in both FIGS. 10and 11 .

A suitable information source 1001 provides a sequence B, having k bitsof binary data {B₀, . . . , B_(k−1)}, to the illustrated encoder. Asplit block 1002 splits, segments, or separates the source informationsequence B into two parts (e.g., a first subsequence and a secondsubsequence): B(0)˜B(i−1) and B(i)˜B(k−1), as in the example of FIG. 6 .This split may correspond to any suitable division or segmentation ofthe source information sequence into two or more subsequences that mayor may not be mutually exclusive of one another. Once the sourceinformation sequence is split, in the illustrated example, the splitblock 1002 provides the first subsequence B(0)˜B(i−1) to a DM 1004, andprovides the second subsequence B(i)˜B(k−1) to a channel coder 1008. Asin the example of FIG. 6 , any suitable DM 1004 and channel coder 1008may be utilized in a given implementation. In the discussion thatfollows, for completeness, an example having a channel coder 1008configured for LDPC coding is described.

The DM 1004 maps its input B(0)˜B(i−1) to an output sequence A havingelements A(0)˜A(m−1) shaped according to probabilistic constellationshaping. The DM 1004 provides its PCS sequence A to a suitablyconfigured amplitude-to-binary (A→B) mapping block 1006, which maps thesymbol sequence A to an ordered sequence of binary bitsb[A(0)]˜b[A(m−1)]. The A→B block 1006 provides this binary sequence tothe channel coder block 1008.

The channel coder 1008 encodes its pre-encoding input sequence (in theillustrated example, the pre-encoding input sequence may be representedas a concatenation of the binary sequence b[A(0)]˜b[A(m−1)]corresponding to a PCS-mapped portion of the source sequence, and thesecond part B(i)˜B(k−1) of the source information sequence, which is notsubject to probabilistic constellation shaping, and is mapped to auniformly distributed constellation). The channel coder 1008 encodesthis input to generate an encoded output sequence C, which in someexamples, may be represented by a sequence of parity bits C(0)˜C(n−1).In some examples that employ a systematic-type code, this encodedsequence C can be represented as including a set of K systematic bits,and a set of (n−K) parity bits (note that the encoded output sequence Cincludes n bits). And in some examples that employ a systematic-typecode, the encoded sequence C can include the parity bits but omit thesystematic bits, with the systematic bits being sourced directly fromthe DM 1004 and later concatenated with the parity bits.

In the description that follows, for reasons that will become clear, anew parameter N=(n−2Z_(c)) is introduced. The parameter 4 was describedabove in relation to puncturing operations of an LDPC encoder configuredaccording to 3GPP specifications for 5G NR. Thus, the number (n−K) ofparity bits of the encoded output sequence C may equivalently berepresented by (N+2Z_(c)−K).

Block 1014 represents a sequence split or segmentation operation, suchthat this block splits the output C of the channel coder 1008 into twoor more output sequences. In the example illustrated in FIG. 11 , thisresults in the coder output having a representation with three segments:a first segment including K systematic bits, a second segment including(N−K) parity bits, and a third segment including 2Z_(c) parity bits.

That is, the splitter 1014 splits or separates a set of 2Z_(c) bits fromthe parity bits of the encoded output sequence C. In some examples, thelast or final set of 2Z_(c) bits may be the separated bits, but anysuitable set of 2Z_(c) bits may be separated in a given example. Thesplit block 1014 then provides the segment of 2Z_(c) bits to a suitablyconfigured binary-to-analog (B→A) mapping block, which converts thosebits to an output sequence having a number P of amplitude symbols. In anaspect of this disclosure, the (B→A) mapping block 1012 performs theinverse operation or function of the (A→B) mapping block 1006.

The (B→A) mapping block 1012 provides its output sequence of P amplitudesymbols to block 1010, which operates to replace the first P symbols(e.g., the set of P symbols of the amplitude symbol sequenceA(0)˜A(m−1), which are associated with the first 2Z_(c) bits of thesystematic bits), with the output sequence from block 1012. That is, inan aspect of this disclosure, a portion of the systematic bitscorresponding to the first 2Z_(c) bits of that sequence, may bepunctured. The punctured portion is then replaced with the same number2Z_(c) of bits (e.g., the last 2Z_(c) bits) from the non-systematic(e.g., parity) bits.

As discussed above, the amplitude symbol sequence A output by the DM1004 corresponds to a sequence of probabilistically-shaped QAM-formatsymbols. However, as discussed above, the set of P symbols output by the(B→A) mapping block 1012 was not subject to distribution matching. Thatis, in an aspect of this disclosure, the (B→A) mapping block 1012 maygenerate a sequence of QAM-format symbols based on the 2Z_(c) paritybits of the encoded sequence C. Here, the output of the (B→A) mappingblock 1012 is not subjected to distribution matching, and thus, the setof P replacement symbols are uniformly-distributed QAM symbols.Accordingly, block 1010 replaces the punctured shaped-amplitude symbolsfrom the symbol sequence A with P non-shaped symbols corresponding to aconstellation with uniformly-distributed probabilities, from thenon-systematic (parity) portion of the encoder output.

A sign bits extraction block 1018 extracts a sequence S of m sign bitsfrom the parity bits C, and provides the sign bit sequence S to a signmultiply block 1016. The sign multiply block 1016 then combines the signbit sequence S with the sequence A of amplitude symbols from the DM 1004described above (having symbols corresponding to punctured bitsreplaced), to generate a sequence of output symbols X(0)˜X(m−1). Amodulation function 1020 then modulates the output symbols (e.g.,according to QAM) for transmission via one or more antennas.

With this example, an encoder may be configured to encode a given blockof information utilizing a non-systematic code, even when employingconstellation shaping. For example, an encoder may employ an LDPC codingalgorithm where a sequence of 2Z_(c) bits is punctured from thesystematic bits (corresponding to PCS shaped-amplitude symbols), andreplaced with a sequence of 2Z_(c) bits (corresponding to non-shapedsymbols) sourced from the sequence of parity bits or sign bits.

FIG. 12 is a flow chart illustrating an exemplary process 1200 forconstellation shaping-related coding in accordance with some aspects ofthe present disclosure, e.g., corresponding to FIGS. 10 and 11 and theircorresponding description above. As described below, a particularimplementation may omit some or all illustrated features, and may notrequire some illustrated features to implement all embodiments. In someexamples, the communication device 700 illustrated in FIG. 7 may beconfigured to carry out the process 1200. In some examples, any suitableapparatus or means for carrying out the functions or algorithm describedbelow may carry out the process 1200. In the illustrated example, thefunctions or operations shown are performed from the point of view of aphysical layer entity in a transmitting device. For example, an encoder,which may include probabilistic signal shaping and channel codingfeatures, may be configured to implement the process illustrated in FIG.12 .

At block 1202, a transmitting device may encode a source informationsequence utilizing a suitable error correction code, e.g., an LDPC code(e.g., utilizing a channel coder 1008, as described above). Here, theencoded output sequence includes a set of systematic bits and a set ofnon-systematic (e.g., parity or check) bits.

At block 1204, the transmitting device may generate a set ofprobabilistically-shaped symbols (e.g., PCS-QAM symbols) correspondingto at least a portion of the source information sequence (e.g.,utilizing a DM 1004, as described above). According to some examples,the set of probabilistically-shaped symbols may correspond to at least aportion of the systematic bits, or the part of the source informationsequence that appears unaltered in the encoded output sequence.

At block 1206, the transmitting device may generate a set ofnon-probabilistically-shaped symbols (e.g., QAM symbols with a uniformlydistributed constellation) corresponding to at least a portion of theencoded output sequence (e.g., utilizing a B→A mapper 1012 as describedabove). According to some examples, the non-probabilistically-shapedsymbols may correspond to at least a portion of the parity bits, or thenon-systematic part of the encoded output sequence.

At block 1208, the transmitting device may replace a portion of the setof probabilistically-shaped symbols, with a set ofnon-probabilistically-shaped symbols corresponding to a portion of theparity bits. For example, the transmitting device may puncture a givennumber of symbols (e.g., the number P of symbols that represent a set of2Z_(c) bits according to a suitable mapping algorithm between binarybits and analog symbols) of the shaped-symbol sequence, corresponding tothe systematic bits, with a corresponding number of symbols from thenon-shaped, uniform constellation symbol sequence, corresponding to thenon-systematic bits.

At block 1210, the transmitting device may modulate and transmit awaveform based on the output sequence. For example, a modulation block1020 may generate a waveform corresponding to the amplitude sequence fortransmission, and a transceiver 710 may transmit the waveform, asdescribed above.

Modifying the Symbol Sequence

FIG. 13 provides a schematic timing diagram showing various stages of aprobabilistic shaping-related encoding process according to anotheraspect of the present disclosure. In some aspects, the processillustrated in FIG. 13 can be considered a modification of the processdescribed above and illustrated in FIGS. 10-12 . However, as shown inFIG. 13 , the order or sequence of the symbols corresponding tosystematic bits is modified to reduce or eliminate the impact of apuncturing operation on the probabilistically shaped symbols. That is,with reference to the example shown in FIG. 11 , the bits correspondingto the shaped PCS symbols A(0)˜A(m−1) are located at the front of thepre-encoding input sequence. In this case, as described above, whenpuncturing is applied to the first bits of the systematic bits, at leasta portion of the probabilistically shaped symbols become punctured, andare replaced with other symbols.

However, in the example of FIG. 13 , the sequence of bits {b[A_(m)]}corresponding to the sequence of PCS symbols {A_(m)} is placed at theend or rear of the pre-encoding input sequence. At the front orbeginning of the pre-encoding input sequence appear the systematic bitscorresponding to the subsequence B(i)˜B(k−1). And, as described above(see FIG. 10 ), the symbols corresponding to the subsequence B(i)˜B(k−1)are not subject to probabilistic constellation shaping, and are mappedto a uniformly distributed constellation. Accordingly, a puncturing ofbits at the beginning of the systematic bits may not affect any shapedsymbols, as long as the number of bits that are punctured is less thanor equal to the number of bits of the subsequence B(i)˜B(k−1). Further,even in the case where greater than the number of bits of thesubsequence B(i)˜B(k−1) are punctured, the impact to the PCS shapedsymbols can be reduced relative to the previous example.

Accordingly, in some examples employing the sequence operationsdescribed above and illustrated in FIG. 13 , a communication device canfollow the procedure illustrated in the flow chart of FIG. 12 , butomitting block 1208 to replace punctured bits with parity bits.

In a still further aspect of this disclosure, at block 1212, acommunication device may decide whether or not to replace punctured bitscorresponding to shaped symbols, based on whether a puncturing operationresults in a puncturing of bits corresponding to shaped symbols. Forexample, denote the number of bits of the subsequence B(i)˜B(k−1) as q.In an example where q≥the number of punctured bits (e.g., 2Z_(c)), thenthe puncturing does not extend beyond the bits of the subsequenceB(i)˜B(k−1), and an operation corresponding to block 1208 can beomitted. However, in an example where q<the number of punctured bits(e.g., 2Z_(c)), then the puncturing extends beyond the bits of thesequence B(i)˜B(k−1). In this case, the communication device may replacepunctured bits with parity bits formulated from symbols with a uniformlydistributed constellation, as described above in block 1208.

Receiver-Based Example

FIG. 14 provides a schematic timing diagram showing various stages of aprobabilistic shaping-related encoding process according to a stillfurther aspect of the present disclosure. FIG. 14 further provides aflow chart illustrating an exemplary process 1400 for constellationshaping-related decoding in accordance with some aspects of the presentdisclosure. As described below, a particular implementation may omitsome or all illustrated features, and may not require some illustratedfeatures to implement all embodiments.

At block 1402, a communication device may receive a PCS waveform. Insome aspects, the process illustrated in FIG. 14 can be considered amodification of the process described above and illustrated in FIGS.10-12 . However, as shown in FIG. 14 , systematic bits are not replacedwith parity bits. Instead, the systematic bits may be fully included inthe transmission. That is, the code may be transmitted largely accordingto conventional procedures, except for omitting the last 2Z_(c) bits ofthe sequence of parity bits. At a receiving device, at block 1404, thefirst 2Z_(c) bits of the set of systematic bits are not used during adecoding process. Rather, a decoder may apply a suitable decodingprocedure, e.g., one corresponding to a punctured LDPC code, to decodethe remaining bits.

FIG. 15 is a flow chart illustrating an exemplary process 1500 forconstellation shaping-related coding in accordance with some aspects ofthe present disclosure. As described below, a particular implementationmay omit some or all illustrated features, and may not require someillustrated features to implement all embodiments. In some examples, thecommunication device 700 illustrated in FIG. 7 may be configured tocarry out the process 1500. In some examples, any suitable apparatus ormeans for carrying out the functions or algorithm described below maycarry out the process 1500. In the illustrated example, the functions oroperations shown are performed from the point of view of a physicallayer entity in a transmitting device. For example, an encoder, whichmay include probabilistic signal shaping and channel coding features,may be configured to implement the process illustrated in FIG. 15 .

At block 1502, a wireless communication device generates, based on asource information sequence, a sequence of symbols representing amessage for transmission. For example, a modulation mapper, a DM, or anyother suitable symbol generator may be utilized to convert, e.g., abinary sequence into a complex amplitude sequence.

At block 1504, the device determines whether probabilistic constellationshaping is applied. For example, the device may determine whether areceived set of configuration parameters includes one or moreconstellation shaping parameters. That is, according to an aspect of thepresent disclosure, if the configuration indicates that probabilisticconstellation shaping is to be applied, the configuration received atblock 1504 may include one or more suitable constellation shapingparameters. Some examples of constellation shaping parameters caninclude a binary-bits-to-amplitude-symbols mapping parameter, adistribution parameter for configuring a DM for shaping a constellationfor a target probability distribution, and an explicit (e.g., direct)instruction whether to apply probabilistic constellation shaping. Ingeneral, the modem may identify any suitable parameter that enables orconfigures PCS as a parameter sufficient to apply probabilisticconstellation shaping.

At block 1506, the device encodes the source information sequence basedon a non-systematic type code if the sequence of symbols generated inblock 1502 does not have a probabilistic constellation shaping property.On the other hand, at block 1508, the device encodes the sourceinformation sequence based on a systematic type code if at least aportion of the sequence of symbols generated in block 1502 has aprobabilistic constellation shaping property. In various examples, anysuitable error correction coding may be employed for encoding the sourceinformation sequence, as described above.

Some implementation examples are described below in the followingnumbered examples:

Example 1. A method, apparatus, and/or non-transitory computer-readablemedium for:

-   -   receiving a source information sequence representing a message        for transmission;    -   encoding the source information sequence based on a        systematic-type code if probabilistic constellation shaping is        to be applied;    -   encoding the source information sequence based on a        non-systematic-type code if probabilistic constellation shaping        is not to be applied;    -   generating a sequence of symbols representing the message for        transmission; and    -   transmitting a waveform based on the sequence of symbols.

Example 2. The method, apparatus, and/or non-transitorycomputer-readable medium of example 1, further for:

-   -   receiving configuration information relating to a modulation        scheme or coding scheme;    -   encoding the source information sequence based on the        systematic-type code if the configuration information comprises        an indication relating to probabilistic constellation shaping;        and    -   encoding the source information sequence based on the        non-systematic-type code if the configuration information does        not comprise an indication relating to probabilistic        constellation shaping, or comprises an explicit indication not        to apply probabilistic constellation shaping.

Example 3. The method, apparatus, and/or non-transitorycomputer-readable medium of either of examples 1-2, wherein theindication relating to probabilistic constellation shaping comprises atleast one of:

-   -   an explicit indication to apply or not to apply probabilistic        constellation shaping; or    -   one or more constellation shaping parameters.

Example 4. The method, apparatus, and/or non-transitorycomputer-readable medium of any of examples 1-3,

-   -   wherein encoding the source information sequence based on a        systematic-type code comprises setting a value of a puncturing        parameter to 0, the puncturing parameter relating to puncturing        a systematic portion of the message; and    -   wherein encoding the source information sequence based on a        non-systematic-type code comprises setting the value of the        puncturing parameter to a nonzero value.

Example 5. The method, apparatus, and/or non-transitorycomputer-readable medium of any of examples 1-3,

-   -   wherein encoding the source information sequence based on a        systematic-type code comprises utilizing a first base graph, and    -   wherein encoding the source information sequence based on a        non-systematic-type code comprises utilizing a second base        graph, different from the first base graph.

Example 6. A method, apparatus, and/or non-transitory computer-readablemedium for:

-   -   generating a set of probabilistically-shaped symbols        corresponding to at least a first portion of a source        information sequence;    -   generating a pre-encoding sequence corresponding to at least a        second portion of the source information sequence;    -   applying error correction coding to the pre-encoding sequence to        generate an encoded sequence comprising a set of systematic bits        and a set of parity bits;    -   generating a first set of non-probabilistically-shaped symbols        corresponding to at least a portion of the set of parity bits;    -   replacing a portion of the set of probabilistically-shaped        symbols with the set of non-probabilistically shaped symbols to        generate an output sequence; and    -   modulating a waveform based on the output sequence.

Example 7. The method, apparatus, and/or non-transitorycomputer-readable medium of example 6, further for:

-   -   generating a binary sequence based on the set of        probabilistically-shaped symbols,    -   wherein the pre-encoding sequence comprises a concatenation of        the second portion of the source information sequence and the        binary transformed sequence based on the        probabilistically-shaped symbols.

Example 8. The method, apparatus, and/or non-transitorycomputer-readable medium of either of examples 6-7, wherein thepre-encoding sequence comprises the binary transformed sequence based onthe probabilistically-shaped symbols sequentially preceding the secondportion of the source information sequence.

Example 9. The method, apparatus, and/or non-transitorycomputer-readable medium of any of examples 6-8, further for:

-   -   generating a second set of non-probabilistically shaped symbols        corresponding to at least a portion of the set of systematic        bits; and    -   puncturing a subset of symbols of the set of        probabilistically-shaped symbols,    -   wherein the replacing the portion of the set of        probabilistically-shaped symbols further comprises determining        that the puncturing applies to no greater than a number of        symbols corresponding to the second set of non-probabilistically        shaped symbols.

Example 10. A method, apparatus, and/or non-transitory computer-readablemedium for:

-   -   receiving a waveform comprising a set of        probabilistically-shaped symbols and a set of        non-probabilistically shaped symbols;    -   demodulating the received waveform to generate a sequence of        bits; and    -   decoding the sequence of bits by omitting a portion of the bits        corresponding to a portion of the set of        probabilistically-shaped symbols.

Example 11. A method, apparatus, and/or non-transitory computer-readablemedium for:

-   -   generating, based on a source information sequence, a sequence        of symbols representing a message for transmission;    -   encoding the source information sequence based on a        systematic-type code if at least a portion of the generated        sequence of symbols has a probabilistic constellation shaping        property, or based on a non-systematic-type code if the sequence        of symbols does not have the probabilistic constellation shaping        property; and    -   transmitting a waveform based on the generated sequence of        symbols.

Example 12. A method, apparatus, and/or non-transitory computer-readablemedium of example 11, further for:

-   -   receiving configuration information relating to a modulation        scheme or coding scheme;    -   applying probabilistic constellation shaping for encoding the        source information sequence if the configuration information        comprises an indication relating to probabilistic constellation        shaping; and    -   encoding the source information sequence without applying        probabilistic constellation shaping for if the configuration        information does not comprise an indication relating to        probabilistic constellation shaping, or comprises an explicit        indication not to apply probabilistic constellation shaping.

Example 13. A method, apparatus, and/or non-transitory computer-readablemedium of either of examples 11 or 12, further for:

-   -   encoding the source information sequence based on the        systematic-type code by setting a value of a puncturing        parameter to 0, the puncturing parameter relating to puncturing        a systematic portion of the message; and    -   encoding the source information sequence based on the        non-systematic-type code by setting the value of the puncturing        parameter to a nonzero value.

Example 14. A method, apparatus, and/or non-transitory computer-readablemedium of either of examples 11 or 12, further for:

-   -   encoding the source information sequence based on the        systematic-type code by utilizing a first base graph, and    -   encoding the source information sequence based on the        non-systematic-type code by utilizing a second base graph,        different from the first base graph.

This disclosure presents several aspects of a wireless communicationnetwork with reference to an exemplary implementation. As those skilledin the art will readily appreciate, various aspects described throughoutthis disclosure may be extended to other telecommunication systems,network architectures and communication standards.

By way of example, various aspects may be implemented within othersystems defined by 3GPP, such as Long-Term Evolution (LTE), the EvolvedPacket System (EPS), the Universal Mobile Telecommunication System(UMTS), and/or the Global System for Mobile (GSM). Various aspects mayalso be extended to systems defined by the 3rd Generation PartnershipProject 2 (3GPP2), such as CDMA2000 and/or Evolution-Data Optimized(EV-DO). Other examples may be implemented within systems employing IEEE802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Ultra-Wideband (UWB),Bluetooth, and/or other suitable systems. The actual telecommunicationstandard, network architecture, and/or communication standard employedwill depend on the specific application and the overall designconstraints imposed on the system.

The present disclosure uses the word “exemplary” to mean “serving as anexample, instance, or illustration.” Any implementation or aspectdescribed herein as “exemplary” is not necessarily to be construed aspreferred or advantageous over other aspects of the disclosure.Likewise, the term “aspects” does not require that all aspects of thedisclosure include the discussed feature, advantage or mode ofoperation. The present disclosure uses the term “coupled” to refer to adirect or indirect coupling between two objects. For example, if objectA physically touches object B, and object B touches object C, thenobjects A and C may still be considered coupled to one another—even ifthey do not directly physically touch each other. For instance, a firstobject may be coupled to a second object even though the first object isnever directly physically in contact with the second object. The presentdisclosure uses the terms “circuit” and “circuitry” broadly, to includeboth hardware implementations of electrical devices and conductors that,when connected and configured, enable the performance of the functionsdescribed in the present disclosure, without limitation as to the typeof electronic circuits, as well as software implementations ofinformation and instructions that, when executed by a processor, enablethe performance of the functions described in the present disclosure.

One or more of the components, steps, features and/or functionsillustrated in FIGS. 1-14 may be rearranged and/or combined into asingle component, step, feature or function or embodied in severalcomponents, steps, or functions. Additional elements, components, steps,and/or functions may also be added without departing from novel featuresdisclosed herein. The apparatus, devices, and/or components illustratedin FIGS. 1-14 may be configured to perform one or more of the methods,features, or steps described herein. The novel algorithms describedherein may also be efficiently implemented in software and/or embeddedin hardware.

It is to be understood that the specific order or hierarchy of steps inthe methods disclosed is an illustration of exemplary processes. Basedupon design preferences, it is understood that the specific order orhierarchy of steps in the methods may be rearranged. The accompanyingmethod claims present elements of the various steps in a sample order,and are not meant to be limited to the specific order or hierarchypresented unless specifically recited therein.

Applicant provides this description to enable any person skilled in theart to practice the various aspects described herein. Those skilled inthe art will readily recognize various modifications to these aspects,and may apply the generic principles defined herein to other aspects.Applicant does not intend the claims to be limited to the aspects shownherein, but to be accorded the full scope consistent with the languageof the claims, wherein reference to an element in the singular is notintended to mean “one and only one” unless specifically so stated, butrather “one or more.” Unless specifically stated otherwise, the presentdisclosure uses the term “some” to refer to one or more. A phrasereferring to “at least one of” a list of items refers to any combinationof those items, including single members. As an example, “at least oneof: a, b, or c” is intended to cover: a; b; c; a and b; a and c; b andc; and a, b and c. All structural and functional equivalents to theelements of the various aspects described throughout this disclosurethat are known or later come to be known to those of ordinary skill inthe art are expressly incorporated herein by reference and are intendedto be encompassed by the claims. Moreover, nothing disclosed herein isintended to be dedicated to the public regardless of whether suchdisclosure is explicitly recited in the claims.

1. A method of wireless communication, comprising: receiving a source information sequence representing a message for transmission; encoding the source information sequence based on a systematic-type code if probabilistic constellation shaping is to be applied; encoding the source information sequence based on a non-systematic-type code if probabilistic constellation shaping is not to be applied; generating a sequence of symbols representing the message for transmission; and transmitting a waveform based on the sequence of symbols.
 2. The method of claim 1, further comprising: receiving configuration information relating to a modulation scheme or coding scheme; encoding the source information sequence based on the systematic-type code if the configuration information comprises an indication relating to probabilistic constellation shaping; and encoding the source information sequence based on the non-systematic-type code if the configuration information does not comprise an indication relating to probabilistic constellation shaping, or comprises an explicit indication not to apply probabilistic constellation shaping.
 3. The method of claim 2, wherein the indication relating to probabilistic constellation shaping comprises at least one of: an explicit indication to apply or not to apply probabilistic constellation shaping; or one or more constellation shaping parameters.
 4. The method of claim 1, wherein encoding the source information sequence based on the systematic-type code comprises setting a value of a puncturing parameter to 0, the puncturing parameter relating to puncturing a systematic portion of the message; and wherein encoding the source information sequence based on the non-systematic-type code comprises setting the value of the puncturing parameter to a nonzero value.
 5. The method of claim 1, wherein encoding the source information sequence based on the systematic-type code comprises utilizing a first base graph, and wherein encoding the source information sequence based on the non-systematic-type code comprises utilizing a second base graph, different from the first base graph.
 6. A method of wireless communication, comprising: generating a set of probabilistically-shaped symbols corresponding to at least a first portion of a source information sequence; generating a pre-encoding sequence corresponding to at least a second portion of the source information sequence; applying error correction coding to the pre-encoding sequence to generate an encoded sequence comprising a set of systematic bits and a set of parity bits; generating a first set of non-probabilistically-shaped symbols corresponding to at least a portion of the set of parity bits; replacing a portion of the set of probabilistically-shaped symbols with the set of non-probabilistically shaped symbols to generate an output sequence; and modulating a waveform based on the output sequence.
 7. The method of claim 6, further comprising: generating a binary sequence based on the set of probabilistically-shaped symbols, wherein the pre-encoding sequence comprises a concatenation of the second portion of the source information sequence and the binary transformed sequence based on the probabilistically-shaped symbols.
 8. The method of claim 7, wherein the pre-encoding sequence comprises the binary transformed sequence based on the probabilistically-shaped symbols sequentially preceding the second portion of the source information sequence.
 9. The method of claim 6, further comprising: generating a second set of non-probabilistically shaped symbols corresponding to at least a portion of the set of systematic bits; and puncturing a subset of symbols of the set of probabilistically-shaped symbols, wherein the replacing the portion of the set of probabilistically-shaped symbols further comprises determining that the puncturing applies to no greater than a number of symbols corresponding to the second set of non-probabilistically shaped symbols.
 10. (canceled)
 11. A wireless communication apparatus, comprising: a processor; a memory communicatively coupled to the processor; and a transceiver communicatively coupled to the processor, wherein the processor and the memory are configured for: receiving a source information sequence representing a message for transmission; encoding the source information sequence based on a systematic-type code if probabilistic constellation shaping is to be applied; encoding the source information sequence based on a non-systematic-type code if probabilistic constellation shaping is not to be applied; generating a sequence of symbols representing the message for transmission; and transmitting, via the transceiver, a waveform based on the sequence of symbols.
 12. The wireless communication apparatus of claim 11, wherein the processor and the memory are further configured for: receiving, via the transceiver, configuration information relating to a modulation scheme or coding scheme; encoding the source information sequence based on the systematic-type code if the configuration information comprises an indication relating to probabilistic constellation shaping; and encoding the source information sequence based on the non-systematic-type code if the configuration information does not comprise an indication relating to probabilistic constellation shaping, or comprises an explicit indication not to apply probabilistic constellation shaping.
 13. The wireless communication apparatus of claim 12, wherein the indication relating to probabilistic constellation shaping comprises at least one of: an explicit indication to apply or not to apply probabilistic constellation shaping; or one or more constellation shaping parameters.
 14. The wireless communication apparatus of claim 11, wherein encoding the source information sequence based on the systematic-type code comprises setting a value of a puncturing parameter to 0, the puncturing parameter relating to puncturing a systematic portion of the message; and wherein encoding the source information sequence based on the non-systematic-type code comprises setting the value of the puncturing parameter to a nonzero value.
 15. The wireless communication apparatus of claim 11, wherein encoding the source information sequence based on a systematic-type code comprises utilizing a first base graph, and wherein encoding the source information sequence based on a non-systematic-type code comprises utilizing a second base graph, different from the first base graph.
 16. A wireless communication apparatus, comprising: a processor; a memory communicatively coupled to the processor; and a transceiver communicatively coupled to the processor, wherein the processor and the memory are configured for: generating a set of probabilistically-shaped symbols corresponding to at least a first portion of a source information sequence; generating a pre-encoding sequence corresponding to at least a second portion of the source information sequence; applying error correction coding to the pre-encoding sequence to generate an encoded sequence comprising a set of systematic bits and a set of parity bits; generating a first set of non-probabilistically-shaped symbols corresponding to at least a portion of the set of parity bits; replacing a portion of the set of probabilistically-shaped symbols with the set of non-probabilistically shaped symbols to generate an output sequence; and modulating, via the transceiver, a waveform based on the output sequence.
 17. The wireless communication apparatus of claim 16, wherein the processor and the memory are further configured for: generating a binary sequence based on the set of probabilistically-shaped symbols, wherein the pre-encoding sequence comprises a concatenation of the second portion of the source information sequence and the binary transformed sequence based on the probabilistically-shaped symbols.
 18. The wireless communication apparatus of claim 17, wherein the pre-encoding sequence comprises the binary transformed sequence based on the probabilistically-shaped symbols sequentially preceding the second portion of the source information sequence.
 19. The wireless communication apparatus of claim 16, wherein the processor and the memory are further configured for: generating a second set of non-probabilistically shaped symbols corresponding to at least a portion of the set of systematic bits; and puncturing a subset of symbols of the set of probabilistically-shaped symbols, wherein the replacing the portion of the set of probabilistically-shaped symbols further comprises determining that the puncturing applies to no greater than a number of symbols corresponding to the second set of non-probabilistically shaped symbols. 20.-44. (canceled) 